package leetcode.code0023;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;
import leetcode.helper.tree.ListNode;

public abstract class Solution23 implements IDebug {

	public abstract ListNode mergeKLists(ListNode[] lists);

	@Override
	public void debug1() {
		String str = "[[1,4,5],[1,3,4],[2,6]]";
		ListNode[] lists = ListNode.set2array(HelpDebug.str2array1(str));
		ListNode r = this.mergeKLists(lists);
		String str1 = "[1,1,2,3,4,4,5,6]";
		ListNode e = ListNode.set(HelpDebug.str2array3(str1));
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		String str = "[]";
		ListNode[] lists = ListNode.set2array(HelpDebug.str2array1(str));
		ListNode r = this.mergeKLists(lists);
		String str1 = "[]";
		ListNode e = ListNode.set(HelpDebug.str2array3(str1));
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

}
